In depth first search of a search tree, one progresses by first looking as deeply as possibly down the left most branch at each node one encounters, and then each successive branch in order. This is one of the simplest search strategies alongside breadth first search.
Defined on page 63
Used on pages 63, 65, 66, 67, 68, 69, 72, 74, 78, 80, 82, 428, 429
Also known as depth first, depth first
Depth first search -- order of visiting nodes.